#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m, st, ed, q;
    cin >> n >> m >> st >> ed >> q;
    V<array<int, 2>> w(q + 1);
    w[0] = {st, ed};
    FOR(i, 1, q) cin >> w[i][0] >> w[i][1];

    V<V<int>> f((1 << q), V<int>(q, 1e18));

    auto dist = [&](array<int, 2> a, array<int, 2> b) {
        auto [x1, y1] = a;
        auto [x2, y2] = b;
        return abs(x1 - x2) + abs(y1 - y2);
    };
    FOR(i, 1, q) {
        f[0][i - 1] = dist(w[0], w[i]);
    }

    FOR(i, 0, (1 << q) - 1) {
        FOR(j, 0, q - 1) {
            FOR(k, 0, q - 1) {
                if (i >> k & 1) {
                    f[i][j] = min(f[i][j], f[i ^ (1 << k)][k] + dist(w[j + 1], w[k + 1]));
                }
            }
        }
    }
    int ans = 1e18;

    FOR(i, 0, q - 1) {
        ans = min(ans, f[(1 << q) - 1][i] + dist(w[0], w[i + 1]));
    }
    cout << "The shortest path has length ";
    cout << ans << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
